Allowable delay bound for consensus of linear multi-agent systems with communication delay

This paper studies the consensus of a group of linear dynamic agents with a uniform communication delay and focuses on searching an allowable delay bound. As long as the delay is less than this bound, there exist linear feedback consensus protocols driving the multi-agent system to achieve consensus. Both fixed and switching topology cases are investigated. In both cases, the consensus problem is converted to the robust stability problem of corresponding uncertain state-delayed systems. By using Lyapunov–Krasovskii functional analysis, consensus conditions which contain the feedback gain conditions and delay conditions are proposed for systems over fixed and switching topologies, respectively. Furthermore, allowable delay bounds are obtained for both systems by solving the optimal robust stabilisation problems. Numerical examples are given to illustrate the results.     

FC-AE-ASM网络的模糊可靠性研究

针对目前FC-AE-ASM(fibre channel avionic environment anonymous subscriber messaging)网络可靠性计算问题, 以网络任务模型为基础, 提出了FC-AE-ASM网络的模糊可靠性模型。该模型主要分析了FC-AE-ASM网络的三种基本拓扑, 得出了这三种结构的模糊可靠性表达式。同时, 结合串并联的推导方法, 推导出了FC-AE-ASM冗余网络的模糊可靠性计算式。对实例的计算结果表明, FC-AE-ASM网络模糊可靠性的改善取决于关键因素, 并且基本路径冗余网络在自身网络可靠性较高时与全网冗余网络性能基本相同。     

一种基于对等网络的云资源定位算法

提出用分布式哈希表(DHT)为每台云服务器产生一个唯一的节点编号,该编号作为网络拓扑结构、检索信息存储和信息查询共同的标志符,从而形成一个适合分布式计算的结构化P2P覆盖网.设计了新的拓扑和路由协议来解决云资源的常数跳定位问题.仿真实验表明,经典的P2P算法平均查找跳数与网络规模成正相关,无法依据云计算的实际需要人为地控制查找跳数;该算法的平均查找跳数与网络规模无关,随着网络规模的增大而趋向于设定值,可以解决云资源的常数跳定位问题.     

基于实时拓扑图的发射台站网络监控管理系统

只要存在网络就必然会进行网络拓扑的管理,就一个短波发射台而言,网络设备的种类和类型繁多,路由器、交换机、服务器和防火墙等等.如果某个网络设备出了问题,有可能会导致整个网络都不能正常访问,通过实现网络拓扑图与实时状态关联,不仅将这个网络拓扑图展现出来后,同时也将各网络节点的运行状态实时展现,从而达到网络运行监控的可视性和预判性对网络运行全面监控.在设备或应用发生问题时,主动进行规划、防御和告警.     

煤矿井下人员行走轨迹的算法研究

针对目前煤矿人员定位系统主要采用区域定位方式,存在无法直接解算出井下人员的精确位置和无法确定井下人员运动方向的问题,提出了一种基于树形结构、通过构建拓扑关系计算井下人员可能行走轨迹的算法。该算法首先定义了点与弧段、弧段与弧段以及弧段与点的拓扑模型,并以此为基础构建树形结构,对其进行层次遍历,得到井下人员行走轨迹;在计算过程中,该算法利用井下接收器的实时状态信息,自动排除停止工作的接收器和分站对轨迹的影响,有效确保了轨迹的准确性。     

A Causal Fusion Inference Method for Industrial Alarm Root Cause Analysis Based on Process Topology and Alarm Event Data

Modern industrial systems are usually in large scale, consisting of massive components and variables that form a complex system topology. Owing to the interconnections among devices, a fault may occur and propagate to exert widespread influences and lead to a variety of alarms. Obtaining the root causes of alarms is beneficial to the decision supports in making corrective alarm responses. Existing data-driven methods for alarm root cause analysis detect causal relations among alarms mainly based on historical alarm event data. To improve the accuracy, this paper proposes a causal fusion inference method for industrial alarm root cause analysis based on process topology and alarm events. A Granger causality inference method considering process topology is exploited to find out the causal relations among alarms. The topological nodes are used as the inputs of the model, and the alarm causal adjacency matrix between alarm variables is obtained by calculating the likelihood of the topological Hawkes process. The root cause is then obtained from the directed acyclic graph (DAG) among alarm variables. The effectiveness of the proposed method is verified by simulations based on both a numerical example and the Tennessee Eastman process (TEP) model.     

通信电源集中监控系统网络主备用路由的实现

通过对云南玉溪电信局监控工程实现过程中的网络及双机备份中的一些关键问题的描叙,比较详细的讲解其实现过程,介绍该局网络设计原则、方案,路由器的设置,双机备份等,对其他地区监控网络的实现有一定的参考价值。     

基于ATM虚拟局域网的网络拓扑搜索

动态显示网络系统的拓扑图是网络管理系统的基本功能,目前常见的拓扑搜索算法大部分都是基于网络层的,不能对链路层的动态网络拓扑进行搜索且不能发现和管理虚拟网。提出一种利用SNMP协议、ICMP 协议和ARP协议三种协议相结合的网络拓扑搜索算法,发现ATM网络的链路层网络拓扑和提取ATM虚拟网的配置信息。最后,以哈工大通信所的某一子网（ATM虚拟局域网）为例,对此算法进行了验证。     

基于遗传算法的大规模企业网拓扑设计新算法

企业网拓扑结构设计中的子网划分问题实际上是一个多目标非线性数学规划问题,选取布线距离、流量分配、流量均衡和传输时延作为子网划分的主要制约因素,建立了相应的数学模型并通过遗传算法求解待优化的目标函数以完成子网划分。分析结果表明,此方法能较好地解决大规模网络拓扑设计中的子网划分问题。     

遗传算法在网络扩充中的应用

通信网在运行的过程中,存在着网络的节点扩充及重组等问题。文章从遗传算法的基本原理出发,分析带有约束条件的通信网设计中的网络扩充问题,较好的解决了经济效益和需求的网络设计问题。